Remarks about inverse diffraction problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on inverse Wiener index problem

The sum of distances between all pairs of vertices W (G) in a connected graph G as a graph invariant was first introduced by Wiener [9] in 1947. He observed a correlation between boiling points of paraffins and this invariant, which has later become known as Wiener index of a graph. Today, the Wiener index is one of the most widely used descriptors in chemical graph theory. Due to its strong co...

متن کامل

A computational inverse diffraction grating problem.

Consider the diffraction of a time-harmonic plane wave incident on a perfectly reflecting periodic surface. A continuation method on the wavenumber is developed for the inverse diffraction grating problem, which reconstructs the grating profile from measured reflected waves a constant distance away from the structure. Numerical examples are presented to show the validity and efficiency of the p...

متن کامل

Inverse feasible problem

In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Remarks about Euclidean Domains

We will call (1) the d-inequality. Sometimes it is expressed in a different way: for nonzero a and b, if a|b then d(a) ≤ d(b). This is equivalent to the d-inequality, taking into account of course the different roles of a and b in the two descriptions. Examples of Euclidean domains are Z (with d(n) = |n|), F [T ] for any field F (with d(f) = deg f ; this example is the reason that one doesn’t a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 1984

ISSN: 0022-2488,1089-7658

DOI: 10.1063/1.526498